Identity-Based Key Aggregate Cryptosystem from Multilinear Maps

The key-aggregate cryptosystem (KAC) proposed by Chu et al. in 2014 offers a solution to the flexible access delegation problem in shared data environments such as the cloud. KAC allows a data owner, owning N classes of encrypted data, to securely grant access to any subset S of these data classes among a subset Ŝ of data users, via a single low overhead aggregate key KS . Existing constructions for KAC are efficient in so far they achieve constant size ciphertexts and aggregate keys. But they resort to a public parameter that has size linear in the number of data classes N , and require O(M ′M) secure channels for distribution of aggregate keys in a system with M ′ data owners and M data users. In this paper, we propose three different multilinear-map based KAC constructions that have at most polylogarithmic overhead for both ciphertexts and public parameters, and generate constant size aggregate keys. We further demonstrate how the aggregate keys may be efficiently broadcast among any arbitrary size subset of M data users using only O(M ′ + M) secure channels, in a system with M ′ data owners. Our constructions are secure in the generic multilinear group model and are fully collusion resistant against any number of colluding parties. In addition, they naturally give rise to identity based secure access delegation schemes.